Fragment and Conquer

A divide-and-conquer approach to fragment assembly

MOTIVATION One of the major problems in DNA sequencing is assembling the fragments obtained by shotgun sequencing. Most existing fragment assembly techniques follow the overlap-layout-consensus approach. This framework requires extensive computation in each phase and becomes inefficient with increasing number of fragments. RESULTS We propose a new algorithm which solves the overlap, layout, a...

A divide-and-conquer linear scaling three-dimensional fragment method for large scale electronic structure calculations

We present a new linear scaling ab initio total energy electronic structure calculation method based on a divide-and-conquer strategy. This method is simple to implement, easy to parallelize, and produces accurate results when compared with direct ab initio methods. The new method has been tested on nanosystems with up to 15 000 atoms using up to 8000 processors. (Some figures in this article a...

Divide-And-Conquer Sorting

Divide and Conquer

Process mining has been around for more than a decade now, and in that period several discovery and replay algorithms have been introduced that work fairly well on averagesized event logs. Nevertheless, these algorithms have problems dealing with big event logs. If the algorithms do not run out of memory, they will run out of time, because the problem handed to them is just too complex to be so...

Cooperate and Conquer ∗

The idea that cooperation can be a source of power has been extensively discussed in various disciplines. We study this idea from an economic viewpoint by analyzing the effect of intragroup cooperation in a static group rent-seeking model. Intragroup cooperation means that agents’ rent-seeking efforts maximize their group’s expected payoff. Although intragroup cooperation always reduces average...